Orthogonal polygon reconstruction from stabbing information

Orthogonal Polygon Reconstruction

Stabbing Information of a Simple Polygon

Orthogonal segment stabbing

We study a class of geometric stabbing/covering problems for sets of line segments, rays, and lines in the plane. While we demonstrate that the problems on sets of horizontal/vertical line segments are NP-complete, we show that versions involving (parallel) rays or lines are polynomially solvable.

Polygon Clipping and Polygon Reconstruction

Polygon clipping is an important operation that computers execute all the time. An algorithm that clips a polygon is rather complex. Each edge of the polygon must be tested against each edge of the clipping window, usually a rectangle. As a result, new edges may be added, and existing edges may be discarded, retained, or divided. Multiple polygons may result from clipping a single polygon. Afte...

Stabbing Orthogonal Objects in 3-Space

David M. Mount Fan-Tao Pu Department of Computer Science University of Maryland College Park, MD 20742 fmount,[email protected] 1 Motivation Computer graphics is the source of many interesting and challenging applications for the design of geometric algorithms and data structures. Applications in global illumination simulation and radiosity [7] have motivated our study of problems involving line...